| 翻訳と辞書 |
| Tombstone diagram ： ウィキペディア英語版 |
Tombstone diagram
In computing, tombstone diagrams (or T-diagrams) consist of a set of “puzzle pieces” representing compilers and other related language processing programs. They are used to illustrate and reason about transformations from a source language (left of T) to a target language (right of T) realised in an implementation language (bottom of T). They are most commonly found describing complicated processes for bootstrapping, porting, and self-compiling of compilers, interpreters, and macro-processors.〔Terry, 1997, (Chapter 2 ) and (Chapter 3 )〕
T-diagrams were first introduced for describing bootstrapping and cross-compiling compilers by McKeeman et al. in 1971.〔McKeeman et al., ''A Compiler Generator'' (1971)〕 Melvin Conway described the broader concept before that with his UNCOL in 1958, to which Bratman added in 1961.〔H. Bratman, “An alternate form of the ´UNCOL diagram´“, Comm. ACM 4 (March 1961) 3, p. 142〕 Later on, others, including P.D. Terry, gave an explanation and usage of T-diagrams in their textbooks on the topic of compiler construction.〔 T-diagrams are also now used to describe client-server interconnectivity on the World Wide Web.〔Patrick Closhen, Hans-Juergen Hoffmann, et al. 1997: (''T-Diagrams as Visual Language to Illustrate WWW Technology'' ), Darmstadt University of Technology, Darmstadt, Germany〕 A teaching tool ''TDiag'' has been implemented at Leipzig University, Germany.〔Michael Hielscher, et al.: (''TDiag: Entwicklung und Ausführung eines T-Diagramms'' ), in German〕
==See also==
* Bootstrapping (compilers)
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Tombstone diagram」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|